Reliable Network Interdiction Models with Multiple Unit Costs
نویسندگان
چکیده
منابع مشابه
Reliable Network Interdiction Models with Multiple Unit Costs
Abstract: This paper proposes a reliable network interdiction model with multiple unit costs, which maximizes the minimum arrival cost of the invader to the sink by setting obstacles on some arcs with limited resources in the given network. In other words, given a graph with a source and a sink, several arcs will be selected with limited resources such that each path contains as many weights as...
متن کاملStochastic Network Interdiction: Models and Methods Stochastic Network Interdiction: Models and Methods Stochastic Network Interdiction: Models and Methods Chapter 2. Stochastic Network Interdiction Models List of Tables
vii
متن کاملBilevel Network Interdiction Models: Formulations and Solutions
This definition is unnecessarily restrictive— for instance, it should also include ship-based firepower—but the essence is reasonable: interdiction connotes preemptive attacks that limit an enemy’s subsequent ability to wage war, or carry out other nefarious activities. The mathematical study of interdiction has focused primarily on network interdiction, in which an enemy’s activities are model...
متن کاملNetwork interdiction – models, applications, unexplored directions
Network interdiction is the monitoring or halting of an adversary’s activity on a network. Its models involve two players, usually called the interdictor and the evader (or, in the more general context of Stackelberg games, leader and follower). The evader operates on the network to optimize some objective such as moving through the network as fast as possible (shortest path interdiction), or w...
متن کاملNetwork Optimization with Concave Costs
In this paper the problem of minimum cost communication network design is considered where the costs are piecewise linear concave. Several methods are compared: Simulated Annealing method, a heuristic based on the method proposed by Minoux, and a lagrangian method based on lower bounding procedure.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical and Computational Applications
سال: 2016
ISSN: 2297-8747
DOI: 10.3390/mca21040050